From a simple stochastic model of a program, and a finite state model of a paging algorithm, we derive a Markov chain model of a program executing in a paged computer system. In order to compare the relative merits of paging algorithms, we define the long run expected rate of page faults. Markov chain analysis yields an expression for the long run expected page fault rate as a function of the stationary probability distribution of the Markov chain. This result is applied to compute the long run expected page fault rate expressions for three well-known paging algorithms; least recently used, first-in first-out, and A0. Those expressions are compared for several distributional assumptions.
By: W. F. King, III
Published in: RC3288 in 1971
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .